Queues with deterministic reneging times
نویسندگان
چکیده
We consider single-server and multi-server queues with deterministic reneging times motivated by the timeout mechanisms used in application servers.. A Volterra integral equation is developed using the level crossing analysis for the M/G/1 queue with reneging. An analytical solution is given for the M/HyperExponential/1 queue with deterministic reneging times and a numerical approach is presented for the M/G/1 queue with deterministic reneging times. We further present an approximation method for the expected waiting time in the M/G/n queue with deterministic reneging times. Approximations are verified via simulation and numerical results reveal that predictions are highly accurate with errors, in general, below 5%.
منابع مشابه
An approximation for multi-server queues with deterministic reneging times
In this paper, we studied multi-server queue with Poisson arrivals, general service time distribution, and deterministic reneging times. This work was motivated by the timeout mechanism used in managing application servers in transaction processing environments. In such systems, a customer who stays in the queue longer than the timeout period is lost. We proposed a scaling approach, and a fast ...
متن کاملFluid Limits of Many-servers Queues with Reneging
This work considers a many-server queueing system in which impatient customers with i.i.d., generally distributed service times and i.i.d., generally distributed patience times enter service in the order of arrival and abandon the queue if the time before possible entry into service exceeds the patience time. The dynamics of the system is represented in terms of a pair of measure-valued process...
متن کاملHeavy traffic analysis for EDF queues with reneging
This paper presents a heavy-traffic analysis of the behavior of a single-server queue under an Earliest-Deadline-First (EDF) scheduling policy, in which customers have deadlines and are served only until their deadlines elapse. The performance of the system is measured by the fraction of reneged work (the residual work lost due to elapsed deadlines), which is shown to be minimized by the EDF po...
متن کاملWaiting Time Analysis of Multi-class Queues with Impatient Customers
In this paper, we study three delay systems where different classes of impatient customers arrive according to independent Poisson processes. In the first system, a single server receives two classes of customers with general service time requirements, and follows a non-preemptive priority policy in serving them. Both classes of customers abandon the system when their exponentially distributed ...
متن کاملThe Impact of Delay Announcements in Many-Server Queues with Abandonment
This paper studies the performance impact of making delay announcements to arriving customers who must wait before starting service in a many-server queue with customer abandonment. The queue is assumed to be invisible to waiting customers, as in most customer contact centers, when contact is made by telephone, email or instant messaging. Customers who must wait are told upon arrival either the...
متن کامل